Local Subgroups of the Monster and Odd Code Loops

نویسندگان

  • THOMAS M. RICHARDSON
  • T. M. RICHARDSON
چکیده

The main result of this work is an explicit construction of p-local subgroups of the Monster, the largest sporadic simple group. The groups constructed are the normalizers in the Monster of certain subgroups of order 32 , 52 , and 72 and have shapes 32+5+10-(Af11 xGL(2, 3)), 52+2+4-(S3xGL(2, 5)), and 72+1+2 • GL(2, 7). These groups result from a general construction which proceeds in three steps. We start with a self-orthogonal code C of length n over the field Fp , where p is an odd prime. The first step is to define a code loop L whose structure is based on C . The second step is to define a group N of permutations of functions from F2 to L. The final step is to show that N has a normal subgroup K of order p2 . The result of this construction is the quotient group N/K of shape p2+m+2m(S x GL(2,p)), where m + 1 = dim(C) and S is the group of permutations of Aut(C). To show that the groups we construct are contained in the Monster, we make use of certain lattices A(C), defined in terms of the code C . One step in demonstrating this is to show that the centralizer of an element of order p in N/K is contained in the centralizer of an element of order p in the Monster. The lattices are useful in this regard since a quotient of the automorphism group of the lattice is a composition factor of the appropriate centralizer in the Monster. This work was inspired by a similar construction using code loops based on binary codes that John Conway used to construct a subgroup of the Monster of shape 22+11+22 • (M24 x GL(2, 2)).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit representations of maximal subgroups of the Monster

Most of the maximal subgroups of the Monster are now known, but in many cases they are hard to calculate in. We produce explicit ‘small’ representations of all the maximal subgroups which are not 2-local. The representations we construct are available on the World Wide Web at http://brauer.maths.qmul.ac.uk/Atlas/. 1 The maximal subgroups of the Monster By the work of several authors [13, 14, 17...

متن کامل

Fuzzy subgroups of the direct product of a generalized quaternion group and a cyclic group of any odd order

Bentea and Tu{a}rnu{a}uceanu~(An. c{S}tiinc{t}. Univ. Al. I.Cuza Iac{s}, Ser. Nouv{a}, Mat., {bf 54(1)} (2008), 209-220)proposed the following problem: Find an explicit formula for thenumber of fuzzy subgroups of a finite hamiltonian group of type$Q_8times mathbb{Z}_n$ where $Q_8$ is the quaternion group oforder $8$ and $n$ is an arbitrary odd integer. In this paper weconsider more general grou...

متن کامل

Maximum sum element orders of all proper subgroups of PGL(2, q)

In this paper we show that if q is a power of a prime p , then the projective special linear group PSL(2, q) and the stabilizer of a point of the projective line have maximum sum element orders among all proper subgroups of projective general linear group PGL(2, q) for q odd and even respectively

متن کامل

Code Loops in Both Parities

We present equivalent definitions of code loops in any characteristic p 6= 0. The most natural definition is via combinatorial polarization, but we also show how to realize code loops by linear codes and as a class of symplectic conjugacy closed loops. For p odd, it is possible to define code loops via characteristic trilinear forms. Related concepts are discussed.

متن کامل

A MIXED PARABOLIC WITH A NON-LOCAL AND GLOBAL LINEAR CONDITIONS

Krein [1] mentioned that for each PD equation we have two extreme operators, one is the minimal in which solution and its derivatives on the boundary are zero, the other one is the maximal operator in which there is no prescribed boundary conditions. They claim it is not possible to have a related boundary value problem for an arbitrarily chosen operator in between. They have only considered lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995